Time as a Metric for Defence in Survivable Networks

نویسندگان

  • Kalle Burbeck
  • Sara Garcia Andres
  • Simin Nadjm-Tehrani
  • Michael Semling
چکیده

Critical infrastructures of today’s society are built over networks that require a degree of survivability not foreseen when they were built. This paper reports on work in progress in a European project that aims to safeguard critical infrastructures such as electricity and telecom networks. It assumes that there will be accidents, attacks, and failures in parts of a network. The goal of safeguard is to enable delivery of the essential services despite these. Hence, we define a metric for network level survivability in terms of a continuous function of critical components’ availability and integrity. We further go on to measure the survivability of the system in terms of the time taken to breach of survivability. In a system where the implemented defence/recovery mechanisms are not adequate, this time is finite. In a system that implements self-healing, the presence of attacks and failures is continuously compensated by defence and recovery mechanisms. Again, a measure of time to recover from component failures is a key to increased network survivability. The paper presents a preliminary study of defence mechanisms in a telecom management network, and illustrates how simulations of the network and harmful data can be used to identify trade-offs that are central to increased survivability. Keywords—Survivability, Simulation, Intrusion Tolerance, Dependability, Timely defence.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Strategy to Find Solution for Survivable Multicommodity ‎Network‎

This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...

متن کامل

Evaluation of Defence Mechanisms in Survivable Networks

In this paper we present an environment for evaluating self-healing mechanisms in survivable networks. The work is based on the thesis that system level requirements of integrity and availability can be inherently conflicting, and that the type and level of defence in each particular network should be determined in relation to the particular network’s characteristics. The study shows that defin...

متن کامل

Semiotics of Collective Memory of the Iran-Iraq War (Holy Defence): A Case Study of the Shared Images in Virtual Social Networks

This study aims to achieve a semiotic understanding of collective memory of the Iran-Iraq war. For this purpose, samples of images in virtual social networks shared in response to the news of discovery and return of the bodies of more than 175 divers have been analyzed. Visual signs in photographs, cartoons, graphic designs, prints, paintings and posters, in methods of historical pictures and f...

متن کامل

A DWT and SVM based method for rolling element bearing fault diagnosis and its comparison with Artificial Neural Networks

A classification technique using Support Vector Machine (SVM) classifier for detection of rolling element bearing fault is presented here.  The SVM was fed from features that were extracted from of vibration signals obtained from experimental setup consisting of rotating driveline that was mounted on rolling element bearings which were run in normal and with artificially faults induced conditio...

متن کامل

A heuristic algorithm for survivable mapping in IP-over-WDM networks

Survivability is an important issue in IP-over-WDM networks. IP layer failure recovery is possible only if the IP topology is mapped onto the WDM topology in a survivable way, i.e., the failure of any single fiber will not disconnect the IP topology. This problem has been proven NP-hard in [1]. And an integer linear programming (ILP) formulation that solves this problem is provided in [2]. We p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003